Counting Successes: Effects and Transformations for Non-deterministic Programs
نویسندگان
چکیده
منابع مشابه
Photon counting schemes and performance of non–deterministic nonlinear gates in linear optics
The performance of nondeterministic nonlinear gates in linear optics relies on the photon counting scheme being employed and the efficiencies of the detectors in such schemes. We assess the performance of the nonlinear sign gate, which is a critical component of linear optical quantum computing, for two standard photon counting methods: the double detector array and the visible light photon cou...
متن کاملApplying abstract acceleration to (co-)reachability analysis of reactive programs
Acceleration methods are commonly used for computing precisely the effects of loops in the reachability analysis of counter machine models. Applying these methods on synchronous dataflow programs, e.g. Lustre programs, requires to deal with the non-deterministic transformations due to numerical input variables. In this article we address this problem by extending the concept of abstract acceler...
متن کاملA Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq
As a case-study in machine-checked reasoning about the complexity of algorithms in type theory, we describe a proof of the average-case complexity of Quicksort in Coq. The proof attempts to follow a textbook development, at the heart of which lies a technical lemma about the behaviour of the algorithm for which the original proof only gives an intuitive justification. We introduce a general fra...
متن کاملContinuity of super- and sub-additive transformations of continuous functions
We prove a continuity inheritance property for super- and sub-additive transformations of non-negative continuous multivariate functions defined on the domain of all non-negative points and vanishing at the origin. As a corollary of this result we obtain that super- and sub-additive transformations of continuous aggregation functions are again continuous aggregation functions.
متن کاملProbabilistic and Non-deterministic Semantics for Iterative Programs
In this paper probabilistic and non-deterministic programs are considered on the ground of logic of programs. We are interested in dependencies between nondeterministic and probabilistic interpretation of a program. The formal definitions of probabilistic and non-deterministic semantics are the starting point for our considerations. The emphasis is on differences in expressibility the halting p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016